package 剑指offer;



import java.util.Deque;
import java.util.LinkedList;

/**
 * @ClassName _06从尾到头打印链表
 * @Description TODO
 * @Author 昝亚杰
 * @Date 2022/2/23 20:01
 * Version 1.0
 **/
public class _06从尾到头打印链表 {
    /*public int[] reversePrint(ListNode head) {
        Deque<Integer> stack = new LinkedList();
        ListNode temp = head;
        while(temp != null){
            stack.push(temp.val);
            temp = temp.next;
        }
        int[] res = new int[stack.size()];
        for(int i = 0; i < res.length; i++){
            res[i] = stack.pop();
        }
        return res;
    }*/
}
